Transition-oriented hidden Markov models for speaker verification

نویسندگان

  • S. Douglas Peters
  • Matthieu Hébert
  • Daniel Boies
چکیده

In this article, we present a novel mechanism by which more precise voiceprints can be constructed in a typical text-dependent speaker veri cation system based on a continuous density hidden Markov model (HMM). Typical voiceprints (speaker-dependent HMMs) are rst trained using a subscriber's enrollment data. The resulting models are then restructured to permit a modeling of sub-state behavior. At rst, the restructured models are functionally equivalent to the conventional voiceprint. Sub-state parameters are then estimated by the re-application of the enrollment data. The resulting speaker-dependent models provide improved speaker veri cation performance relative to the models with the original topology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Method for Adaptive Training of Polynomial Networks with Applications to Speaker Verification

Speaker verification is the process of determining the validity of a claimed identity through voice. Traditional approaches to this problem are Gaussian mixture models and hidden Markov models. Although these methods work well, they are difficult to employ in an adaptive framework because of the iterative nature of training. Ideally, as we acquire new-labeled input, we would like to update the ...

متن کامل

Speaker verification based on phonetic decision making

Speaker verification based on phone modelling is examined in this paper. Phone modelling is attractive, because different phonemes have different levels of usefulness for speaker recognition, and because phone modelling essentially makes a speaker verification algorithm text independent. The speaker verification system used here is based on a two stage approach, where speech recognition (segmen...

متن کامل

On Word Boundary Detection in Digit-based Speaker Verification

In an automatic speaker verification (ASV) system with prompted passwords, we use vocabulary-dependent hidden Markov models and rely on the ability to explicitly locate the corresponding words and their boundaries in the speech signal. In an experiment on 41 speakers in a Swedish telephone speech database, we compare the use of utterance segmentation produced by automatic and manual methods, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000